Minimal and maximal constituents of twisted Foulkes characters
نویسندگان
چکیده
We prove combinatorial rules that give the minimal and maximal partitions labelling the irreducible constituents of a family of characters for the symmetric group that generalize Foulkes permutation characters. Restated in the language of symmetric functions, our results determine all minimal and maximal partitions that label Schur functions appearing in the plethysms sν ◦ s(m). As a corollary we prove two conjectures of Agaoka on the lexicographically least constituents of the plethysms sν ◦ s(m) and sν ◦ s(1m).
منابع مشابه
Set Families and Foulkes Modules
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label the irreducible characters appearing as summands of the characters of Foulkes modules. The homomorphisms are defined using certain families of subsets of the na...
متن کاملRestricting Unipotent Characters in Finite Symplectic Groups
We compute the irreducible constituents of the restrictions of all unipotent characters of the groups Sp4(q) and Sp6(q) and odd q to their maximal parabolic subgroups stabilizing a line. It turns out that these restrictions are multiplicity free. We also obtain general information about the restrictions of Harish-Chandra induced characters.
متن کاملMAXIMAL ALLOCATED BENEFIT AND MINIMAL ALLOCATED COST AND ITS APPLICATION
In this paper, we investigate the problems of consensus-making among institution in stock exchange with multiple criteria for evaluating performance when the players (institutions) are supposed to be egoistic and the score for each criterion for a player is supposed to be a positive score. Each player sticks to his superiority regarding the criteria. This paper introduces the models for computi...
متن کاملThe generalized Gelfand – Graev characters of GL n ( F q ) ( extended abstract )
Introduced by Kawanaka in order to find the unipotent representations of finite groups of Lie type, generalized Gelfand–Graev characters have remained somewhat mysterious. Even in the case of the finite general linear groups, the combinatorics of their decompositions has not been worked out. This paper re-interprets Kawanaka’s definition in type A in a way that gives far more flexibility in com...
متن کاملFoulkes Characters, Eulerian Idempotents, and an Amazing Matrix
John Holte [17] introduced a family of “amazing matrices” which give the transition probabilities of “carries” when adding a list of numbers. It was subsequently shown that these same matrices arise in the combinatorics of the Veronese embedding of commutative algebra [4, 7, 8] and in the analysis of riffle shuffling [7, 8]. We find that the left eigenvectors of these matrices form the Foulkes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. London Math. Society
دوره 93 شماره
صفحات -
تاریخ انتشار 2016